منابع مشابه
APHID Game-Tree Search
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is controlled by a master and a series of slave processors. The master searches the rst d 0 ply of the game-tree repeatedly. The slaves are responsible for the bottom plies of the game-tree. The slaves asynchronously read work lists from the master and return scor...
متن کاملBootstrapping from Game Tree Search
In this paper we introduce a new algorithm for updating the parameters of a heuristic evaluation function, by updating the heuristic towards the values computed by an alpha-beta search. Our algorithm differs from previous approaches to learning from search, such as Samuel’s checkers player and the TD-Leaf algorithm, in two key ways. First, we update all nodes in the search tree, rather than a s...
متن کاملMulti-processor Game-tree Search
The design, implementation, and performance of two chess programs running on a multi-processor system are presented. Methods for distributing and enhancing the alpha-beta algorithm in a parallel environment are discussed. With the Principal Variation Splitting method, a four processor chess program yields a 3.35 fold speed-up over the sequential version. [Recreated from files dated 4 May 1984 i...
متن کاملMonte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of establishing challenging game AI. In this paper, we put forward Monte-Carlo Tree Search as a novel, unified framework to game AI. In the framework, randomized explorations of the search space are used to predict the most...
متن کاملParallelizations of Game-Tree Search
This paper presents a parallelization of the ? procedure which is used in two-person game-tree searches. The main previous studies in this area are analyzed and classiied according to the three techniques of parallelization used. A new parallel algorithm founded on the exploration of the critical tree which is speciic to the sequential ? procedure and on an horizontal decomposition of game-tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 1989
ISSN: 2468-2438,1389-6911
DOI: 10.3233/icg-1989-12207